The Initial Functions in a Subdivision Scheme
نویسندگان
چکیده
In this paper we shall study the initial functions in a subdivision scheme in a Sobolev space. By investigating the mutual relations among the initial functions in a subdivision scheme, we are able to study in a relatively uniied approach several questions related to a subdivision scheme in a Sobolev space such as convergence, error estimate and convergence rate of a subdivision scheme in a Sobolev space with a general dilation matrix. A generalized deenition of convergence of subdivision schemes in Banach spaces is also introduced. x1. Introduction Reenable functions play an important role in wavelet analysis. As widely used in computer aided geometric design, a subdivision scheme is a powerful tool in investigating various properties of reenable functions. An s s integer matrix M is called a dilation matrix if lim k!1 M ?k = 0. We say that a is a mask on ZZ s if a is a nitely supported sequence on ZZ s such that P 2ZZ s a() = 1. Wavelets are derived from reenable functions via a standard multiresolution technique. A reenable function is a solution to the following reenement equation = j det Mj X 2ZZ s a()(M ?); (1) where a is a mask and M is a dilation matrix. For a mask a on ZZ s and an s s dilation matrix M, it is known that there exists a unique compactly supported distributional solution, denoted by M a throughout the paper, to the reenement equation (1) such that ^ M a (0) = 1, where the Fourier transform of f 2 L 1 (IR s) is deened to be ^
منابع مشابه
Spline Subdivision Schemes for Compact Sets with Metric Averages
To de ne spline subdivision schemes for general compact sets we use the representation of spline subdivision schemes in terms of repeated averages and replace the usual average convex combination by a binary averaging operation between two compact sets introduced in and termed here the metric average These schemes are shown to converge in the Hausdor metric and to provide O h approximation x In...
متن کاملHow Data Dependent is a Nonlinear Subdivision Scheme? A Case Study Based on Convexity Preserving Subdivision
The regularity of the limit function of a linear subdivision scheme is essentially irrelevant to the initial data. How data dependent, then, is the regularity of the limit of a nonlinear subdivision scheme? The answer is the most obvious it depends. In this paper, we prove that the nonlinear convexity preserving subdivision scheme developed independently by Floater/Micchelli [12] and Kuijt/van ...
متن کاملA Controllable Ternary Interpolatory Subdivision Scheme
A non-uniform 3-point ternary interpolatory subdivision scheme with variable subdivision weights is introduced. Its support is computed. The C and C convergence analysis are presented. To elevate its controllability, a modified edition is proposed. For every initial control point on the initial control polygon a shape weight is introduced. These weights can be used to control the shape of the c...
متن کاملA Fuzzy Expert System for Predicting the Performance of Switched Reluctance Motor
In this paper a fuzzy expert system for predicting the performance of a switched reluctance motor has been developed. The design vector consists of design parameters, and output performance variables are efficiency and torque ripple. An accurate analysis program based on Improved Magnetic Equivalent Circuit (IMEC) method has been used to generate the input-output data. These input-output data i...
متن کاملPolynomial reproduction for univariate subdivision schemes of any arity
In this paper we study the ability of convergent subdivision schemes to reproduce polynomials in the sense that for initial data, which is sampled from some polynomial function, the scheme yields the same polynomial in the limit. This property is desirable because the reproduction of polynomials up to some degree d implies that a scheme has approximation order d +1. We first show that any conve...
متن کامل